1935C - Messenger in MAC - CodeForces Solution

import sys
input = sys.stdin.readline
from heapq import heappop, heappush
t = int(input())
for _ in range(t):
    n, l = map(int, input().split())
    p = []
    for _ in range(n):
        a, b = map(int, input().split())
        p.append((b, a))
    p.sort()
    ans = 0
    for i in range(n):
        h = []
        cur = 0
        count = 0
        ans = max(ans, count)
        for j in range(i, n):
            cur += p[j][1]
            heappush(h, -p[j][1])
            count += 1
            while count and cur + p[j][0] - p[i][0] > l:
                count -= 1
                cur += heappop(h)
            ans = max(ans, count)
    print(ans)